#include<iostream>
#include<queue>
using namespace std;

int main()
{
    int arr[] = { 1,2,3,4,5 };
    int n = sizeof(arr) / sizeof(int);

    vector<int> nums(arr, arr + n);

    priority_queue<int> V(nums.begin(), nums.end());
    int k = 2;

    for (int i = 0; i < k; i++)
    {
        V.pop();
    }
    return V.top();

	return 0;
}